Coloring certain proximity graphs
نویسندگان
چکیده
منابع مشابه
Total Coloring of Certain Double Vertex Graphs
In this paper we investigate the total coloring number for double vertex graphs of some of the most common classes of graphs. Mathematics Subject Classification: 05C15
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملSub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used as “subroutines” for other combinatorial optimization problems. In the sub-coloring problem, given a graph G, we want to partition the vertices of G into minimum number of sub-color classes, where each sub-color clas...
متن کاملColoring Semirandom Graphs
We study semirandom k-colorable graphs made up as follows. Partition the vertex set V = {1, . . . , n} randomly into k classes V1, . . . , Vk of equal size and include each Vi-Vj -edge with probability p independently (1 ≤ i < j ≤ k) to obtain a graph G0. Then, an adversary may add further Vi-Vj-edges (i 6= j) to G0, thereby completing the semirandom graph G = G∗n,p,k . We show that if np ≥ max...
متن کاملColoring graphs using topology
Higher dimensional graphs can be used to color 2dimensional geometric graphs G. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colorable with 4 colors. The later goal is achieved if all interior edge degrees are even. Using a refinement process which cuts the interior along surfaces S we can adapt the degrees along the boundary S. More effic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1990
ISSN: 0898-1221
DOI: 10.1016/0898-1221(90)90032-f